algorithm model web dgraph intern workshop text classif time effici label propag time dbase graph affili network decad structur properti natur aris network internet social network web graph studi intens view understand evolut recent empir work leskovec kleinberg faloutso identifi surpris properti evolut real world network densif ratio edg vertic grow time shrink diamet diamet reduc time constant properti run counter convent wisdom inconsist graph model prior work paper present model simpl realist mathemat tractabl gener model intrins explain properti social network densif shrink diamet model base idea studi empir social scienc primarili groundbreak work breiger bipartit model social network captur affili agent societi present algorithm har structur consequ model specif show overcom bottleneck densif comput shortest path vertic produc spars subgraph preserv approxim shortest distanc distinguish subset vertic rare algorithm benefit deriv realist graph model final work present modular approach connect random graph paradigm preferenti attach edg copi structur consequ heavi tail degre distribut shrink diamet secur lossless watermark techniqu patent infring corrigendum effici similar search classif rank aggreg ronald fagin corrigendum correct error paper error discov alexandr andoni correct theorem due author alexandr andoni mihai tra scu theorem state collect point rm random unit vector log suitabl chosen arbitrari point defin rank list li point sort increas order distanc project ri element medrank median lm member medrank minim probabl state theorem hold version hold replac median rank median suitabl defin score give counterexampl origin theorem present modif theorem result algorithm counterexampl intuit theorem hold situat suppos queri point nearest neighbor distanc random unit vector rankr denot rank point list lr set point sort distanc project true rankr lt rankr hold fraction time random choic infer median rank take consider point bad dataset rankr lt rankr half time rank high rankr gt rankr copyright held author owner video suggest discoveri youtub take random walk view graph commun lower bound chromat number programm cluster network router evolv support higher level network function tradit network layer transport layer protocol programm major design issu network devic os ndo recent base type os embed system hand build high perform internet router shelf pc class hardwar cluster technolog goal suez project build cluster base internet router generalpurpos processor input output link control packet schedul gigabit sec system area network switch fabric paper present design initi implement suez os featur scalabl real time packet schedul cach consciou rout tabl lookup intra cluster distribut buffer memori manag highli effici kernel extens mechan activ network usin hard approxim multicut sparsest dcut show multicut sparsest cut min cnf delet problem np hard approxim constant factor assum uniqu game conjectur khot stoc quantit stronger version conjectur impli inapproxim factor log log compar partial rank abstract provid comprehens pictur compar partial rank rank ti propos metric compar partial rank prove constant multipl kei word partial rank bucket order permut metric am subject classif doi hard approxim multicut sparsest dcut show multicut sparsest cut min cnf delet problem np hard approxim constant factor assum uniqu game conjectur khot stoc quantit stronger version conjectur impli inapproxim factor log log exploit anarchi network game dtheoret approach combin fair throughput unweav web document multi dstructur databas report submit public ibm copyright accept public issu research report earli dissemin coctent view transfer copyright tti publish distribut cutsid ibm prior public limit peer commun specif request public request fill reprint legal obtain copi articl payment royalti effici implement larg dscale multi dstructur databas earlier work defin multi structur databas data model support effici analysi larg complex data set multipl numer hierarch dimens defin type queri data model requir solv optim problem framework algorithm trend analysi massiv tempor data set mechan equit bandwidth alloc qo budget constraint graph dtheoret approach extract storylin search result compar aggreg rank ti rank aggreg recent propos abstract applic includ meta search synthes rank function multipl indic similar search classif inform statist approach data stream commun complex present method prove strong lower bound commun complex effici similar search classif rank aggreg propos approach perform effici similar search classif high dimension data framework databas element vector euclidean space queri vector space goal find element databas similar queri approach small number independ voter rank databas element base similar queri rank combin highli effici aggreg algorithm methodolog lead techniqu comput approxim nearest neighbor conceptu rich altern nearest neighbor compar top list motiv applic introduc distanc measur top list distanc measur metric distanc measur show metric seemingli unrel aspect satisfi relax version polygon triangl inequ ii metric posit constant multipl bound measur coincid show notion metric formal ident base notion defin distanc measur equival bound constant multipl identifi larg robust equival class distanc measur applic task identifi good notion di similar top list result impli polynomi time constant factor approxim algorithm rank aggreg problem dkn respect larg class distanc measur siam discret mathemat extend abstract acm siam symposium discret algorithm soda applic inform complex show lower bound concret complex model parti commun complex model show tribe function input side error random complex nondeterminst complex nondeterminist complex separ random nondeterminist complex settl open problem kushilevitz nisan pose beam lawri search workplac web social impact world wide web underestim technolog build web revolution share busi govern inform intranet wai lesson learn internet carri directli intranet appli social forc guid develop intranet di erent determin good answer intranet search di erent internet paper studi problem intranet search approach focus rank aggreg examin ect di erent heurist rank search result link evolut analysi algorithm abstract anticip futur web search techniqu exploit web structur content step direct examin problem integr observ link structur static hyperlink base rank comput present effici algorithm increment comput good approxim googl pagerank brin page link evolv experi reveal algorithm fast yield excel approxim pagerank light larg link structur algorithm deriv intuit partial justif rigor sensit analysi markov chain regular markov chain stationari probabl suppos transit probabl state increas prove increas ad link site stationari probabl target site increas rank improv state order stationari probabl ad link site rank target site improv analysi formal intuit drive googl fail link evolut analysi algorithm abstract anticip futur web search techniqu exploit web structur content step direct examin problem integr observ link structur static hyperlink base rank comput present effici algorithm increment comput good approxim googl pagerank brin page link evolv experi reveal algorithm fast yield excel approxim pagerank light larg link structur algorithm deriv intuit partial justif rigor sensit analysi markov chain regular markov chain stationari probabl suppos transit probabl state increas prove increas ad link site stationari probabl target site increas rank improv state order stationari probabl ad link site rank target site improv analysi formal intuit drive googl fail polynomi dfactor approxim shortest lattic vector length compar top list motiv applic introduc distanc measur top list distanc measur metric distanc measur show metric seemingli unrel aspect satisfi relax version polygon triangl inequ ii metric posit constant multipl bound measur coincid show notion metric formal ident base notion defin distanc measur equival bound constant multipl identifi larg robust equival class distanc measur applic task identifi good notion di similar top list result impli polynomi time constant factor approxim algorithm rank aggreg problem dkn respect larg class distanc measur siam discret mathemat extend abstract acm siam symposium discret algorithm soda inform statist approach data stream commun complex present method prove strong lower bound commun complex algorithm derandom complex theori sampl short lattic vector closest lattic vector problem present time ture reduct closest lattic vector problem shortest lattic vector problem reduct assum access subroutin solv svp subroutin sampl short vector lattic comput epsilon approxim cvp consequ svp algorithm obtain random epsilon algorithm obtain epsilon approxim closest lattic vector problem dimens improv exist time bound cvp achiev determinist algorithm inform theori method commun complex tool techniqu inform theori studi commun complex problem simultan commun model result includ tight character multi parti commun complex product distribut term vc dimens shatter coeffici equival multi parti simultan commun model product distribut suit lower bound specif function simultan commun model notabl optim lower bound multi parti set disjoint problem alon al am gener address function problem babai al bgkl arbitrari group methodolog main contribut render commun complex problem framework inform theori access power calculu inform theori fundament principl fano inequ maximum likelihood estim principl count distinct element data stream present algorithm count number distinct element data stream factor amp plusmn epsilon algorithm improv algorithm problem offer spectrum time space tradeoff reduct stream algorithm introduc reduct stream model tool design stream algorithm develop concept list effici stream algorithm essenti design effici stream algorithm reduct result includ suit list effici stream algorithm basic statist primit reduct paradigm tool design stream algorithm approxim count number triangl graph present stream specif highlight work algorithm number distinct element data stream achiev arbitrari approxim factor independ trevisan tre solv problem approach algorithm advantag list effici approxim count invers data stream abstract invers fundament quantiti measur sorted data evalu rank method databas context rank aggreg volum data set applic data stream model natur set design effici algorithm obtain suit space effici stream algorithm approxim number invers permut factor ffl space bound achiev problem log log log determinist algorithm contrast deriv omega lower bound random exact comput problem approxim essenti gener problem approxim number invers permut obtain random pn log space algorithm approxim number invers gener list give random pn log space pass algorithm contrast deriv omega lower bound determinist approxim comput problem random essenti algorithm log time data item algorithm derandom complex theori dsimilar web overview siev algorithm shortest lattic vector problem polynomi approxim shortest lattic vector length obtain ffl time algorithm approxim length shortest vector dimension lattic factor ffl note complex approxim shortest lattic vector length call svp length approxim factor poli obviou candid produc polynomi approxim svp length schnorr improv lov asz basi reduct algorithm turn uninterest schnorr algorithm take arithmet step polynomi size operand produc approxim obtain poli approxim factor omega gamma run time omega gamma log pointless light algorithm solv show theorem exist absolut constant fl ffl svp length approxim ffl probabilist time fln ffl proof algorithm ajtai reduct svp length problem find short vector special class lattic solv problem adapt idea blum kalai wasserman obtain approxim factor sharpest form reduct due cai nerurkar integ ajtai defin famili lattic defin fl theta matrix fx ax mod main result algorithm set comput vector length random lattic neglig probabl random algorithm compu sampl algorithm lower bound applic ziv bar yossef comput scienc divis berkelei berkelei ca zivi cs berkelei ravi kumar ibm almaden harri road san jose ca ravi almaden ibm sivakumar ibm almaden harri road san jose ca siva almaden ibm abstract develop framework studi probabilist sampl algorithm approxim gener function form arbitrari set goal obtain lower bound queri complex function number input variabl sampl algorithm queri approxim xn defin quantit properti function block sensit minimum helling distanc give techniqu prove lower bound queri complex techniqu gener easi power yield tight result applic includ higher statist moment median select function frequenc moment obtain lower bound close upper bound point connect sampl stream algorithm lossi compress scheme siev algorithm shortest lattic vector problem present random time algorithm comput shortest vector dimension ration lattic time upper bound problem log kannan obtain consequ algorithm relat problem lattic code includ improv polynomi time approxim shortest vector problem improv gain factor log log expon approxim factor dsimilar web uniqu shortest lattic vector problem give simplifi proof theorem lagaria lenstra schnorr problem approxim length shortest lattic vector factor cn constant np hard np conp prove problem findng uniqu shortest lattic vector np hard polynomi time reduct polynomi time hierarchi collaps introduct discret addit subgroup call lattic recent beauti paper ajtai establish explicit connect technic sens worst case averag case complex shortest lattic vector problem problem find approxim shortest lattic vector length tour de forc ajtai establish np hard problem find shortest lattic vector euclidean norm norm problem approximat rank aggreg method web problem combin rank result sourc context web main applic includ build meta search engin combin rank function select document base multipl criteria improv search precis word associ wedevelop set techniqu rank aggreg problem compar perform method primari goal work design rank aggreg techniqu effect combat spam problem web search experi show method simpl effici effect keyword rank aggreg rank function metasearch multi word queri spam uniqu shortest lattic vector problem give simplifi proof theorem lagaria lenstra schnorr problem approxim length shortest lattic vector factor cn constant np hard np conp prove problem findng uniqu shortest lattic vector np hard polynomi time reduct polynomi time hierarchi collaps introduct discret addit subgroup call lattic recent beauti paper ajtai establish explicit connect technic sens worst case averag case complex shortest lattic vector problem problem find approxim shortest lattic vector length tour de forc ajtai establish np hard problem find shortest lattic vector euclidean norm norm problem approximat random graph model web graph web graph page hyperlink world wide web view node edg direct graph graph billion node todai billion link appear grow exponenti time reason mathemat sociolog commerci studi evolut graph review set algorithm oper web graph address problem web search automat commun discoveri classif recal number measur properti web graph note tradit random graph model explain observ propos famili random graph model dtest gener bottleneck suppos program design comput function defin group task test test comput correctli input involv test explicitli comput correctli gener case multivari function number gener number test prohibit larg refer problem gener bottleneck develop techniqu overcom gener bottleneck function nice structur specif relationship valu function set gener easili checkabl techniqu build effici tester linear multilinear linear function includ fft polynomi function tester present make call program test consequ techniqu obtain effici program result checker problem gener resourc dbound measur siamltex resolut hartmani conjectur nl dhard spars set en graph pair vertic reduct produc polynomi number graph polynomi size distinguish vertex pair satisfi condit path path path high probabl uniqu path reduct due avi wigderson wig exploit isol lemma mulmulei vazirani vazira note shortest lattic vector problem show problem decid ration lattic vector length np hard promis vector length proof code polynomi dtime reduc show construct proof system np languag determinist polynomialtim verifi check membership ffl bit bit wit membership round estim random sampl present effici probabilist algorithm estim round convex object plane probe model type access algorithm object defin cole yap cy relat physic devic emploi comput metrolog algorithm simpl effici previou algorithm problem swa ll efnn msy analysi involv prove sharp version planar isoperimetr inequ conjunct result geometr probabl hard perman prove polynomi time algorithm comput perman matrix order invers polynomi fraction input bpp algorithm comput perman matrix hypothesi impli bpp algorithm work suffici larg finit field polynomi larger invers assum success ratio interv integ similar rang assum algorithm probabilist polynomi time algorithm result essenti base black box assumpt perman solver simultan improv result gemmel sudan gs feig lund fl cai hemachandra ch toda abg introduct perman theta matrix defin oe sn oe sn symmetr group letter set permut hard hierarchi theorem probabilist quasi dpolynomi time prove tight hierarchi theorem bound error probabilist quasi polynomi time class hard assumpt show assum perman subexponenti time bp algorithm function exptim subexponenti size circuit ff fi bptime log ff bptime log fi depart comput scienc state univers york buffalo buffalo ny email cai cs buffalo research support part nsf grant ccr guggenheim fellowship depart comput scienc state univers york buffalo buffalo ny email apn cs buffalo research support part nsf grant ccr depart comput scienc univers houston houston tx email siva cs uh research support part nsf career award ccr introduct observ time spars hard set resolut conjectur hartmani build recent breakthrough ogihara resolv conjectur made hartmani exist spars set complet logspac reduct show exist spars hard set logspac reduct logspac prove spars hard set reduct comput nc collaps nc membership compar set set membership compar polynomi time comput function instanc length exclud possibl membership string show sat log membership compar uniquesat extend work ogihara beigel kummer stephan agraw arvind ogi bk aa answer affirm open question suggest buhrman fortnow torenvliet bft proof show sat membership compar uniquesat solv determinist time main technic tool algorithm ar al alr reconstruct polynomi noisi data bivari polynomi factor probabilist martingal bptime class defin probabilist martingal base random approxim scheme show result notion probabilist measur desir robust properti probabilist martingal simul bet game bmr cover class natur proof diagon implicitli shown rsc notion full fledg measur bound error complex class bpp bpe shown satisfi measur conserv axiom lut class give suffici condit term simul decis probabilist martingal impli measur conserv tighter bound error probabilist time hierarchi impli bptime bpp stand contrast recent claim oracl give bptime bpp paper make contribut problem defin determinist measur exponenti class membership compar set set membership compar polynomi time comput function instanc length exclud possibl membership string show sat log membership compar uniquesat extend work ogihara beigel kummer stephan agraw arvind ogi bk aa answer affirm open question suggest buhrman fortnow torenvliet bft proof show sat membership compar uniquesat solv determinist time main technic tool algorithm ar al alr reconstruct polynomi noisi data bivari polynomi factor gener resourc dbound measur siamltex gener resourc dbound measur siamltex gener resourc dbound measur siamltex resolut hartmani conjectur nl dhard spars set en graph pair vertic reduct produc polynomi number graph polynomi size distinguish vertex pair satisfi condit path path path high probabl uniqu path reduct due avi wigderson wig exploit isol lemma mulmulei vazirani vazira constant depth circuit lutz hypothesi resourc bound measur theori studi complex class adapt probabilist method central hypothesi theori assert np measur exponenti time quantit strengthen np effici dtest fself dcorrect linear recurr problem design tester selfcorrector function defin linear recurr present complet packag effici simpl tester corrector result checker function result prove demonstr effici reduct problem problem test linear function matrix group tool includ spectral analysi matric finit field count argument extend techniqu matrix twist yield simpl effici tester linear recurr show techniqu convolut ident obtain simpl tester selfcorrector techniqu promis effici wai test vlsi chip applicationsin control engin signal process exist hard spars set weak reduct recent conjectur hartmani har resolv cs progress made ogi shown spars set hard logspac reduct logspac extend result case spars set hard gener reduc main result exist spars set hard bound truth tabl reduct nc exist spars set hard random logspac reduct side error random logspac exist np hard spars set random polynomi time reduct side error np rp exist log spars hard set truth tabl reduct dspace logn product obtain uniform log log log time parallel algorithm comput rank log theta matrix pseudorandom gener measur theori natur proof prove strong pseudorandom number gener exist class languag polynomials circuit poli measur exponenti time term resourc bound measur theori lutz prove result show poli measur exponenti time natur proof poli terminolog razborov rudich provid partial convers result resolut hartmani conjectur build recent breakthrough ogihara resolv conjectur made hartmani exist spars set complet logspac reduct show exist spars hard set logspac reduct logspac prove spars hard set reduct comput nc collaps nc introduct set call spars polynomi number string length spars set subject studi complex theori past year reveal inher structur limit comput bh instanc class languag polynomi time ture reduc cook reduct spars set precis class languag polynomi size circuit major motiv studi spars set reducib dtest gener bottleneck suppos program design comput function defin group task test test comput correctli input involv test explicitli comput correctli gener case multivari function number gener number test prohibit larg refer problem gener bottleneck develop techniqu overcom gener bottleneck function nice structur specif relationship valu function set gener easili checkabl techniqu build effici tester linear multilinear linear function includ fft polynomi function tester present make call program test consequ techniqu obtain effici program result checker problem commun complex kei agreement small rang pseudorandom gener measur theori natur proof prove strong pseudorandom number gener exist class languag polynomials circuit poli measur exponenti time term resourc bound measur theori lutz prove result show poli measur exponenti time natur proof poli terminolog razborov rudich provid partial convers result quasilinear dtime complex theori paper further studi quasilinear time complex initi schnorr gurevich shelah show fundament properti polynomi time hierarchi carri quasilinear time hierarchi quasilinear time complex theori paper further studi quasilinear time complex initi schnorr gurevich shelah show fundament properti polynomi time hierarchi carri quasilinear time hierarchi 